Acting on Norm Constrained Plans

نویسندگان

  • Nir Oren
  • Wamberto Weber Vasconcelos
  • Felipe Meneguzzi
  • Michael Luck
چکیده

The behaviour of deliberative agents is often guided by a plan library designed to achieve goals given certain environmental conditions. Plans in these plan libraries are designed to achieve individual goals, and cannot possibly account for all possible variations of restrictions in the societies within which these agents must operate. These restrictions, captured through norms, include obligations, prohibitions, and permissions. Unlike traditional planning restrictions, norms can often be contradictory and impossible to achieve simultaneously, necessitating some form of compromise. In this paper we describe a technique for taking norms into consideration when deciding how to execute a plan. Our norms are constraint based, allowing for fine-grained control over actions. Our technique allows for reasoning about the interactions between norms, and resolves conflict by selecting actions where the cost of violating one set of norms is outweighed by the reward obtained in complying with another.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composition operators acting on weighted Hilbert spaces of analytic functions

In this paper, we considered composition operators on weighted Hilbert spaces of analytic functions and  observed that a formula for the  essential norm, gives a Hilbert-Schmidt characterization and characterizes the membership in Schatten-class for these operators. Also, closed range composition operators  are investigated.

متن کامل

‎A matrix LSQR algorithm for solving constrained linear operator equations

In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$ma...

متن کامل

Norm Consistency in Practical Reasoning Agents

Agents based on reactive planning architectures use pre-specified plans as behaviour specifications. Typically, such agents are motivated by desires to achieve or maintain states of the world. In this paper, however, we discuss a reactive planning agent architecture – NoA – where the behaviour of an agent is motivated and governed by norms. Normative agents are motivated by obligations to act, ...

متن کامل

Solving Security Constrained Unit Commitment by Particle Swarm Optimization

The issue of unit commitment is one of the most important economic plans in power system. In modern and traditional power systems, in addition to being economical of the planning, the issue of security in unit operation is also of great importance. Hence power system operation confronts units’ participation and input considering network security constrains. The issue of units’ participation is ...

متن کامل

The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint

In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011